Reduction of Rota’s Basis Conjecture to a Problem
نویسندگان
چکیده
It is shown that Rota’s basis conjecture follows from a similar conjecture that involves just three bases instead of n bases.
منابع مشابه
Reduction of Rota's Basis Conjecture to a Problem on Three Bases
It is shown that Rota’s basis conjecture follows from a similar conjecture that involves only three bases instead of n bases. Two counterexamples to the analogous conjecture involving only two bases are presented. [Note added 18 May 2005: Colin McDiarmid found a counterxample to Conjecture 2 after reading a previous version of this paper. See the end of the paper for details.]
متن کاملOn Disjoint Common Bases in Two Matroids
We prove two results on packing common bases of two matroids. First, we show that the computational problem of common base packing reduces to the special case where one of the matroids is a partition matroid. Second, we give a counterexample to a conjecture of Chow, which proposed a sufficient condition for the existence of a common base packing. Chow’s conjecture is a generalization of Rota’s ...
متن کاملWide partitions, Latin tableaux, and Rota’s basis conjecture
Say that μ is a “subpartition” of an integer partition λ if the multiset of parts of μ is a submultiset of the parts of λ, and define an integer partition λ to be “wide” if for every subpartition μ of λ, μ μ′ in dominance order (where μ′ denotes the conjugate of μ). Then Brian Taylor and the first author have conjectured that an integer partition λ is wide if and only if there exists a tableau ...
متن کاملSolving Rota’s Conjecture
I n 1970, Gian-Carlo Rota posed a conjecture predicting a beautiful combinatorial characterization of linear dependence in vector spaces over any given finite field. We have recently completed a fifteen-year research program that culminated in a solution of Rota’s Conjecture. In this article we discuss the conjecture and give an overview of the proof. Matroids are a combinatorial abstraction of...
متن کاملThe Conjectures of Alon--Tarsi and Rota in Dimension Prime Minus One
A formula for Glynn’s hyperdeterminant detp (p prime) of a square matrix shows that the number of ways to decompose any integral doubly stochastic matrix with row and column sums p− 1 into p− 1 permutation matrices with even product, minus the number of ways with odd product, is 1 (mod p). It follows that the number of even Latin squares of order p− 1 is not equal to the number of odd Latin squ...
متن کامل